A Linear Temporal Logic Model Checking Method over Finite Words with Correlated Transition Attributes
نویسندگان
چکیده
Temporal logic model checking techniques are applied, in a natural way, to the analysis of the set of finite traces composing a system log. The specific nature of such traces helps in adapting traditional techniques in order to extend their analysis capabilities. The paper presents an adaption of the classical Timed Propositional Temporal Logic to the case of finite words and considers relations among different attributes corresponding to different events. The introduced approach allows the use of general relations between event attributes by means of freeze quantifiers as well as future and past temporal operators. The paper also presents a decision procedure, as well as a study of its computational complexity.
منابع مشابه
Automata Construction for PSL
The language PSL [1] is a temporal logic standardized by the Accellera standards organization and currently undergoing the process of becoming an IEEE standard. The core of PSL, denoted here LTL WR, is an extension of the linear temporal logic LTL. The extension takes two orthogonal directions. In one direction the logic is interpreted over finite, possibly truncated, as well as infinite words....
متن کاملPath Checking for MTL and TPTL over Data Words
Precise complexity results are derived for the model checking problems for MTL (metric temporal logic) and TPTL (timed propositional temporal logic) on (in)finite data words and deterministic one-counter machines. Depending on the number of register variables and the encoding of numbers in constraints (unary or binary), the complexity is either P-complete or PSPACE-complete.
متن کاملModel Checking the Inconsistency and Circularity in Rule-Based Expert Systems
In the past several years, various techniques were proposed to analyze various types of structural errors, such as inconsistency (conflict rules), and circularity (circular depending rules), of rule-based systems. Model checking is a technique for the verification of temporal logic specifications in state transition systems. In this paper, we model the rule-based systems as finite state transit...
متن کاملAlternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version)
We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL) specifications. Bounded model checking (BMC) is an effective algorithmic method for the verification of finite state systems against temporal specifications expressed in some linear temporal logic, typically LTL. The basis of BMC consists on encoding the existence of a counterexample trace of bounded de...
متن کاملModel Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach
We extend the theory of maximal traces of pointed nondeterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras. We then consider linear coalgebraic temporal logics interpreted over non-deterministic coalgebras, and show how to reduce the model checking problem for such logics to the problem of deciding the winner in a regula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017